On Sets of Integers Not Containing Long Arithmetic Progressions
نویسندگان
چکیده
After this paper was completed, we learned that the main result had in fact been proved much earlier by R.A. Rankin (”Sets of integers containing not more than a given number of terms in arithmetical progression”, Proc. Roy. Soc. Edinburgh Sect. A 65 (1960/1961), 332–344). Since very few people appear to have been aware of that result, I have decided to leave the present paper on my web page as an expository note, with the above explanation added.
منابع مشابه
On rainbow 4-term arithmetic progressions
{sl Let $[n]={1,dots, n}$ be colored in $k$ colors. A rainbow AP$(k)$ in $[n]$ is a $k$ term arithmetic progression whose elements have different colors. Conlon, Jungi'{c} and Radoiv{c}i'{c} cite{conlon} prove that there exists an equinumerous 4-coloring of $[4n]$ which is rainbow AP(4) free, when $n$ is even. Based on their construction, we show that such a coloring of $[4n]$...
متن کاملFurstenberg’s proof of long arithmetic progressions: Introduction to Roth’s Theorem
These are the notes for the first of a pair of lectures that will outline a proof given by Hillel Furstenberg [3] for the existence of long arithmetic progressions in sets of integers with positive upper density, a result first proved by Szemerédi [8]. 1 History of long arithmetic progressions The first major result in the theory of long arithmetic progressions was due to van der Waerden in 192...
متن کاملARITHMETIC PROGRESSIONS IN SPARSE SUMSETS Dedicated to Ron Graham on the occasion of his 70 birthday
In this paper we show that sumsets A + B of finite sets A and B of integers, must contain long arithmetic progressions. The methods we use are completely elementary, in contrast to other works, which often rely on harmonic analysis.
متن کاملArithmetic Progressions in Sparse Sumsets
In this paper we show that sumsets A + B of finite sets A and B of integers, must contain long arithmetic progressions. The methods we use are completely elementary, in contrast to other works, which often rely on harmonic analysis. –Dedicated to Ron Graham on the occasion of his 70 birthday
متن کاملCS 880 : Advanced Complexity Theory 3 / 31 / 2008 Lecture 24 : Additive Combinatorics
A random A yields A+A of size closer to the high end of |A|2. Furthermore, any set A whose members are sufficiently separated has |A+A| close to this high end, and the high end is actually tight for sets A that are geometric progressions, e.g. the first n powers of two. What about the low end of |A|: what is the structure of sets A where |A+A| is close to |A|? We can see that this low-end estim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001